2 Ieee Transactions on Information Theory ,
نویسنده
چکیده
A linear multiuser receiver for a particular user in a CDMA network gains potential beneets from knowledge of the channels of all users in the system. In fast multipath fading environments we cannot assume that the channel estimates are perfect and the inevitable channel estimation errors will limit this potential gain. In this paper we study the impact of channel estimation errors on the performance of linear multiuser receivers, as well as the channel estimation problem itself. Of particular interest are the scalability properties of the channel and data estimation algorithms: what happens to the performance as the system bandwidth and the number of users (and hence channels to estimate) grows? Our main results involve asymptotic expressions for the signal-to-interference ratio of linear multiuser receivers in the limit of large processing gain, with the number of users divided by the processing gain held constant. We employ a random model for the spreading sequences and the limiting signal-to-interference ratio expressions are independent of the actual signature sequences, depending only on the system loading and the channel statistics: background noise power, energy proole of resolvable multipaths and channel coherence time. The eeect of channel uncertainty on the performance of multiuser receivers is succinctly captured by the notion of eeective interference.
منابع مشابه
Comments on "A New Method to Compute the 2-Adic Complexity of Binary Sequences"
We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by H. Xiong, L. Qu, and C. Li, IEEE Transactions on Information Theory, vol. 60, no. 4, pp. 2399-2406, Apr. 2014, and the main result by T. Tian and W. Qi, IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 450...
متن کاملDensity estimation from an individual numerical sequence
This paper considers estimation of a univariate density from an individual numerical sequence. It is assumed that (i) the limiting relative frequencies of the numerical sequence are governed by an unknown density, and (ii) there is a known upper bound for the variation of the density on an increasing sequence of intervals. A simple estimation scheme is proposed, and is shown to be L1 consistent...
متن کاملSEQUANS Communications White Paper: MIMO Techniques for Mobile WiMAX Systems
He has published several journal and conference papers and holds several international patents. a renowned expert in the field of wireless communications. Prior to Stanford, she was with California Institute of Technology and held industry positions at AT&T Bell laboratories and MAXIM Technologies. She is an IEEE Fellow (2005), a Distinguished Lecturer and a member of the Board of Governors of ...
متن کاملComments on 'Generating and counting binary Bent sequences'
We prove that the conjecture on bent sequences stated in Generating and counting bent sequences IEEE Transactions on Information Theory IT No by C M Adams and S E Tavares is false Let Vn be the vector space of n tuples of elements from GF Any map from Vn to GF f can be uniquely written as a polynomial in coordinates x xn f x xn M
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000